Dependency Parser for Chinese Constituent Parsing
نویسندگان
چکیده
Xuezhe Ma, Xiaotian Zhang, Hai Zhao, Bao-Liang Lu Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering, Shanghai Jiao Tong University MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong University, 800 Dong Chuan Rd., Shanghai 200240, China {xuezhe.ma,xtian.zh}@gmail.com, {zhaohai,blu}@cs.sjtu.edu.cn Abstract
منابع مشابه
Why is German Dependency Parsing More Reliable than Constituent Parsing?
In recent years, research in parsing has extended in several new directions. One of these directions is concerned with parsing languages other than English. Treebanks have become available for many European languages, but also for Arabic, Chinese, or Japanese. However, it was shown that parsing results on these treebanks depend on the types of treebank annotations used [ , ]. Another direction ...
متن کاملFeature Engineering in Persian Dependency Parser
Dependency parser is one of the most important fundamental tools in the natural language processing, which extracts structure of sentences and determines the relations between words based on the dependency grammar. The dependency parser is proper for free order languages, such as Persian. In this paper, data-driven dependency parser has been developed with the help of phrase-structure parser fo...
متن کاملSpan-based Statistical Dependency Parsing of Chinese
Using non-constituent spans, we have applied the CYK algorithm to statistical dependency parsing of Chinese, with an additional measure to avoid duplicated e orts. We used a rule-based Chinese parser to generate a training corpus of functionally labelled dependency annotations. In this paper, we describe our span-based CYK algorithm and report initial experimental results.
متن کاملTransition-Based Parsing of the Chinese Treebank using a Global Discriminative Model
Transition-based approaches have shown competitive performance on constituent and dependency parsing of Chinese. Stateof-the-art accuracies have been achieved by a deterministic shift-reduce parsing model on parsing the Chinese Treebank 2 data (Wang et al., 2006). In this paper, we propose a global discriminative model based on the shift-reduce parsing process, combined with a beam-search decod...
متن کاملTransition-based dependency parsing as latent-variable constituent parsing
We provide a theoretical argument that a common form of projective transitionbased dependency parsing is less powerful than constituent parsing using latent variables. The argument is a proof that, under reasonable assumptions, a transition-based dependency parser can be converted to a latent-variable context-free grammar producing equivalent structures.
متن کاملArc-Standard Spinal Parsing with Stack-LSTMs
We present a neural transition-based parser for spinal trees, a dependency representation of constituent trees. The parser uses Stack-LSTMs that compose constituent nodes with dependency-based derivations. In experiments, we show that this model adapts to different styles of dependency relations, but this choice has little effect for predicting constituent structure, suggesting that LSTMs induc...
متن کامل